#include <bits/stdc++.h>
using namespace std;
const int N = 5000010;
int n, k;
int q[N];

int quick_sort(int l, int r, int k) {
	if (l >= r) {
		return q[l];
	}
	int x = q[l + r >> 1];
	int i = l - 1, j = r + 1;
	while (i < j) {
		do
			i++;
		while (q[i] < x);
		do
			j--;
		while (q[j] > x);
		if (i < j) {
			swap(q[i], q[j]);
		}
	}
	if (j - l + 1 >= k) {
		return quick_sort(l, j, k);
	} else {
		return quick_sort(j + 1, r, k - (j - l + 1));
	}
}

int main() {
	cin >> n >> k;
	for (int i = 0; i < n; ++i) {
		scanf("%d", &q[i]);
	}
	cout << quick_sort(0, n - 1, k + 1) << endl;
	return 0;
}